The Lattice of Lambda Theories ( Regular Research Paper )

نویسندگان

  • S. Lusin
  • A. Salibra
چکیده

The lattice Ì of lambda theories is isomorphic to the congruence lattice of the term algebra of the minimal lambda theory ¬. This remark is the starting point for studying the structure of Ì by universal algebraic methods. In this paper we show that Ì satisfies nontrivial lattice quasi-identities, while we conjecture that Ì does not satisfy any nontrivial lattice identity (a lattice identity is trivial if it holds in every lattice and nontrivial otherwise). Further we show that, for every nontrivial lattice identity , there exists a natural number Ò such that fails in the lattice of lambda theories in a language of-terms with Ò constants. We also show that there exists a sublattice of Ì (consisting of all lambda theories extending a suitable lambda theory) which satisfies a restricted form of distributivity, called meet semidistributivity, and a nontrivial congruence identity (i.e., an identity in the language of lattices enriched by the relative product of binary relations).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Lattice of Lambda Theories

Lambda theories are equational extensions of the untyped lambda calculus that are closed under derivation. The set of lambda theories is naturally equipped with a structure of complete lattice, where the meet of a family of lambda theories is their intersection, and the join is the least lambda theory containing their union. In this paper we study the structure of the lattice of lambda theories...

متن کامل

Lambda Calculus: Models and Theories

In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λ-theories, the equational incompleteness of lambda calculus semantics, and the λ-theories induced by graph models of lambda calculus.

متن کامل

On residuated lattices with universal quantifiers

We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

متن کامل

On finitely generated modules whose first nonzero Fitting ideals are regular

A finitely generated $R$-module is said to be a module of type ($F_r$) if its $(r-1)$-th Fitting ideal is the zero ideal and its $r$-th Fitting ideal is a regular ideal. Let $R$ be a commutative ring and $N$ be a submodule of  $R^n$ which is generated by columns of  a matrix $A=(a_{ij})$ with $a_{ij}in R$ for all $1leq ileq n$, $jin Lambda$, where $Lambda $ is a (possibly infinite) index set.  ...

متن کامل

Comparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice

A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002